Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Grammaire CF")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1086

  • Page / 44
Export

Selection :

  • and

A UNIVERSAL CONTEXT-FREE GRAMMAR.KASAI T.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 1; PP. 30-34; BIBL. 9 REF.Article

Tree k-grammar models for natural language modelling and parsingVERDU-MAS, Jose L; FORCADA, Mikel L; CARRASCO, Rafael C et al.Lecture notes in computer science. 2002, pp 56-63, issn 0302-9743, isbn 3-540-44011-9, 8 p.Conference Paper

On array grammars and languagesSUBRAMANIAN, K. G; RANI SIROMONEY.Cybernetics and systems. 1987, Vol 18, Num 1, pp 77-98, issn 0196-9722Article

UN ANALYSEUR SYNTAXIQUE POUR GRAMMAIRES HORS CONTEXTE ASCENDANT SELECTIF ET GENERALCOUSOT P.1972; IN: TECH. INF. CONGR. AFCET. GRENOBLE, 1972; PARIS; AFCET; DA. 1972; VOL. 1; PP. 391-405; BIBL. 1 P.Conference Paper

On the equality of grammatical familiesGINSBURG, S; GOLDSTINE, J; SPANIER, E. H et al.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 171-196, issn 0022-0000Article

Estimating grammar parameters using bounded memoryOATES, Tim; HEERINGA, Brent.Lecture notes in computer science. 2002, pp 185-198, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

LR(k)-coupled-context-free grammarsPITSCH, G.Information processing letters. 1995, Vol 55, Num 6, pp 349-358, issn 0020-0190Article

The generative power of multiple context-free grammars and head grammarsMATSUMURA, T; SEKI, H; FUJII, M et al.Systems and computers in Japan. 1991, Vol 22, Num 4, pp 41-56, issn 0882-1666, 16 p.Article

A structural framework for assembly modeling and recognitionBAUCKHAGE, Christian; KUMMERT, Franz; SAGERER, Gerhard et al.Lecture notes in computer science. 2003, pp 49-56, issn 0302-9743, isbn 3-540-40730-8, 8 p.Conference Paper

Normal proofs and their grammarTAKAHASHI, M; AKAMA, Y; HIROKAWA, S et al.Information and computation (Print). 1996, Vol 125, Num 2, pp 144-153, issn 0890-5401Article

On the size of unanbiguous context-free grammarsWYROSTEK, P.Theoretical computer science. 1986, Vol 47, Num 1, pp 107-110, issn 0304-3975Article

Further study of a stack-length modelGOODWIN, D. T.Computer journal (Print). 1985, Vol 28, Num 1, pp 9-16, issn 0010-4620Article

A note on depth-first derivationsMAKINEN, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 293-296, issn 0006-3835Article

On derivation preservationMAKINEN, E.Information processing letters. 1984, Vol 19, Num 5, pp 225-228, issn 0020-0190Article

Grammaires algébriques et monoïdes simplifiables = Algebraic grammars and monoïd wich we can simplifyFROUGNY, C.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 225-239, issn 0399-0540Article

A characterization of exponential-time languages by alternating context-free grammarsIBARRA, O. H; TAO JIANG; HUI WANG et al.Theoretical computer science. 1992, Vol 99, Num 2, pp 301-313, issn 0304-3975Article

An undecidable problem for context-free grammarsMAKINEN, E.Information processing letters. 1985, Vol 20, Num 3, pp 141-142, issn 0020-0190Article

On Greibach normal form constructionURBANEK, F. J.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 315-317, issn 0304-3975Article

A note on pure grammarsMAGINEN, E.Information processing letters. 1986, Vol 23, Num 5, pp 271-274, issn 0020-0190Article

On ambiguity in dos systemsEHRENFEUCHT, A; HAUSSLER, D; ROZENBERG, G et al.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 279-295, issn 0399-0540Article

Six nonterminals are enough for generating each R.E. language by a matrix grammarPAUN, G.International journal of computer mathematics. 1984, Vol 15, Num 1, pp 23-37, issn 0020-7160Article

SUBSTITUTION OF GRAMMAR FORMS.GINSBURG S; SPANIER EH.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 5; NO 4; PP. 377-386; BIBL. 8 REF.Article

GRAMMATICHE CONTEXT-FREE SU SPAZI METRICI COMPATTI. = GRAMMAIRES INDEPENDANTES DU CONTEXTE SUR DES ESPACES METRIQUES COMPACTSBERTONI A.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 155-170; ABS. ANGL.; BIBL. 5 REF.Article

SYNTACTIC RECOGNITION OF IMPERFECTLY SPECIFIED PATTERNS.THOMASON MG; GONZALEZ RC.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 1; PP. 93-95; BIBL. 11 REF.Article

ANALYSE SYNTAXIQUE PAR LA METHODE DE LA SEPARATION DES PHRASESRYKACZEWSKA B; ZAKOWSKA A.1975; PRACE C.O. P.A.N.; POLSKA; DA. 1975; PP. 1-38; ABS. ANGL. RUSSE; BIBL. 6 REF.Article

  • Page / 44